Area aggregation in map generalisation by mixed-integer programming
نویسندگان
چکیده
منابع مشابه
Area aggregation in map generalisation by mixed-integer programming
Topographic databases normally contain areas of different land cover classes, commonly defining a planar partition, that is, gaps and overlaps are not allowed. When reducing the scale of such a database, some areas become too small for representation and need to be aggregated. This unintentionally but unavoidably results in changes of classes. In this article we present an optimisation method f...
متن کاملArea aggregation in map generalisation by mixed - integer programming JAN - HENRIK
Topographic databases normally contain areas of different land cover classes, commonly defining a planar partition, that is, gaps and overlaps are not allowed. When reducing the scale of such a database, some areas become too small for representation and need to be aggregated. This unintentionally but unavoidably results in changes of classes. In this article we present an optimisation method f...
متن کاملA Formal Model and Mixed-integer Program for Area Aggregation in Map Generalization
This paper presents a model and an optimization method for a problem that appears when reducing the scale of a topographic database. Such a database commonly contains areas of different land cover classes that define a planar subdivision. When reducing its scale, some areas become too small and need to be aggregated. In order to produce contiguous aggregates that are not smaller than a user-def...
متن کاملEfficient automated schematic map drawing using multiobjective mixed integer programming
We present an efficient multiobjective mixed binary linear program that automates schematic mapping for network visualization and navigation. Schematic mapping has broad applications in representing transit networks, circuits, disease pathways, project tasks, organograms, and taxonomies. Good schematic maps employ distortion while preserving topology to facilitate access to physical or virtual ...
متن کاملLocal protein threading by Mixed Integer Programming
During the last decade, significant progresses have been made in solving the Protein Threading Problem (PTP). However, all previous approaches to PTP only perform global sequence–structure alignment. This obvious limitation is in clear contrast with the ”world of sequences”, where local sequence-sequence alignments are widely used to find functionally important regions in families of proteins. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Geographical Information Science
سال: 2010
ISSN: 1365-8816,1362-3087
DOI: 10.1080/13658810903401008